Towards Efficient Positional Inverted Index †

We address the problem of positional indexing in the natural language domain. The positional inverted index contains the information of the word positions. Thus, it is able to recover the original text file, which implies that it is not necessary to store the original file. Our Positional Inverted Self-Index (PISI) stores the word position gaps encoded by variable byte code. Inverted lists of single terms are combined into one inverted list that represents the backbone of the text file since it stores the sequence of the indexed words of the original file. The inverted list is synchronized with a presentation layer that stores separators, stop words, as well as variants of the indexed words. The Huffman coding is used to encode the presentation layer. The space complexity of the PISI inverted list is O((N − n)dlog2b Ne+ (bN−n α c+ n)× (dlog2b ne+ 1)) where N is a number of stems, n is a number of unique stems, α is a step/period of the back pointers in the inverted list and b is the size of the word of computer memory given in bits. The space complexity of the presentation layer is O(−∑ i=1dlog2 p n(i) i e −∑ ′ j=1dlog2 pje+ N) with respect to p n(i) i as a probability of a stem variant at position i, pj as the probability of separator or stop word at position j and N ′ as the number of separators and stop words.